منابع مشابه
Computation of multiple eigenvalues of infinite tridiagonal matrices
In this paper, it is first given as a necessary and sufficient condition that infinite matrices of a certain type have double eigenvalues. The computation of such double eigenvalues is enabled by the Newton method of two variables. The three-term recurrence relations obtained from its eigenvalue problem (EVP) subsume the well-known relations of (A) the zeros of Jν(z); (B) the zeros of zJ ′ ν(z)...
متن کاملEigenvalues for Equivariant Matrices
An equivariant matrix A commutes with a group of permutation matrices. Such matrices often arise in numerical applications where the computational domain exhibits geometrical symmetries, for instance triangles, cubes, or icosahedra. The theory for block diagonalizing equivariant matrices via the Generalized Fourier Transform (GFT) is reviewed and applied to eigenvalue computations. For dense ma...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملEigenvalues and Pseudo-eigenvalues of Toeplitz Matrices
The eigenvalues of a nonhermitian Toeplitz matrix A are usually highly sensitive to perturbations, having condition numbers that increase exponentially with the dimension N. An equivalent statement is that the resolvent ( ZZ A)’ of a Toeplitz matrix may be much larger in norm than the eigenvalues alone would suggest-exponentially large as a function of N, even when z is far from the spectrum. B...
متن کاملCombinatorial Eigenvalues of Matrices
Let S be a subset of diagonal entries of an n × n complex matrix A. When the members of S have a common value which is equal to an eigenvalue of A, then S is a critical diagonal set of A. The existence of such a set is equivalent to the matrix Ã, obtained from A by setting its diagonal entries equal to zero, having an s × t zero submatrix with s + t ≥ n + 1. If S is a minimal critical diagonal ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1987
ISSN: 0024-3795
DOI: 10.1016/0024-3795(87)90335-1